Minimum Number of Edges of Polytopes with $2d+2$ Vertices
نویسندگان
چکیده
We define two $d$-polytopes, both with $2d+2$ vertices and $(d+3)(d-1)$ edges, which reduce to the cube 5-wedge in dimension three. show that they are only minimisers of number amongst all $d$-polytopes vertices, when $d=6$ or $d\ge8$. also characterise minimising polytopes for $d=4, 5$ 7, where four sporadic examples arise.
منابع مشابه
Maximal Number of Vertices of Polytopes Defined by F-Probabilities
Every F-probability (= coherent probability) F on a finite sample space Ωk with k elements defines a set of classical probabilities in accordance with the interval limits. This set, called “structure” of F , is a convex polytope having dimension ≤ k−1. We prove that the maximal number of vertices of structures is exactly k!.
متن کاملEstimating the Number of Vertices in Convex Polytopes
Estimating the number of vertices of a convex polytope defined by a system of linear inequalities is crucial for bounding the run-time of exact generation methods. It is not easy to achieve a good estimator, since this problem belongs to the #P complexity class. In this paper we present two randomized algorithms for estimating the number of vertices in polytopes. The first is based on the well-...
متن کاملThe maximum number of Hamiltonian cycles in graphs with a fixed number of vertices and edges
The problem studied in this paper is that of nding the maximum number of Hamiltonian cycles in a graph with a given number of vertices and edges. The main results are a lower bound and an upper bound, both given by closedform formulas, for the maximum number of Hamiltonian cycles in a graph with a given number of vertices and edges. c © 2000 Elsevier Science B.V. All rights reserved.
متن کاملThe Asymptotic Number of Labeled Connected Graphs with a Given Number of Vertices and Edges
Let c(n, q) be the number of connected labeled graphs with n vertices and q 5 N = ( ) edges. Let x = q/n and k = q n. We determine functions w k 1 , a(x ) and cp(x) such that c (n , q) w k ( z ) e n r p ( x ) e o ( x ) uniformly for all n and q 2 n. If Q > O is fixed, n+= and 4q > ( 1 + ~ ) n log n, this formula simplifies to c(n, q) ( t ) exp(-ne-zq’n). On the other hand, if k = o(n”’), this f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Combinatorics
سال: 2022
ISSN: ['1077-8926', '1097-1440']
DOI: https://doi.org/10.37236/10374